Traducción y análisis de palabras por inteligencia artificial
En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:
- cómo se usa la palabra
- frecuencia de uso
- se utiliza con más frecuencia en el habla oral o escrita
- opciones de traducción
- ejemplos de uso (varias frases con traducción)
- etimología
logic instruction - traducción al árabe
![[[Gottlob Frege]]'s ''[[Begriffschrift]]'' introduced the notion of quantifier in a graphical notation, which here represents the judgement that <math>\forall x. F(x)</math> is true.](https://commons.wikimedia.org/wiki/Special:FilePath/BS-12-Begriffsschrift Quantifier1-svg.svg?width=200 "[[Gottlob Frege]]'s ''[[Begriffschrift]]'' introduced the notion of quantifier in a graphical notation, which here represents the judgement that <math>\forall x. F(x)</math> is true.")
![The [[square of opposition]] is often used to visualize the relations between the four basic [[categorical propositions]] in Aristotelian logic. It shows, for example, that the propositions "All S are P" and "Some S are not P" are contradictory, meaning that one of them has to be true while the other is false.](https://commons.wikimedia.org/wiki/Special:FilePath/Square of opposition, set diagrams.svg?width=200 "The [[square of opposition]] is often used to visualize the relations between the four basic [[categorical propositions]] in Aristotelian logic. It shows, for example, that the propositions \"All S are P\" and \"Some S are not P\" are contradictory, meaning that one of them has to be true while the other is false.")
![Conjunction (AND) is one of the basic operations of boolean logic. It can be electronically implemented in several ways, for example, by using two [[transistor]]s.](https://commons.wikimedia.org/wiki/Special:FilePath/TransistorANDgate.png?width=200 "Conjunction (AND) is one of the basic operations of boolean logic. It can be electronically implemented in several ways, for example, by using two [[transistor]]s.")
![Young America's dilemma: Shall I be wise and great, or rich and powerful? (poster from 1901) This is an example of a [[false Dilemma]]: an informal fallacy using a disjunctive premise that excludes viable alternatives.](https://commons.wikimedia.org/wiki/Special:FilePath/Young America's dilemma - Dalrymple. LCCN2010651418.jpg?width=200 "Young America's dilemma: Shall I be wise and great, or rich and powerful? (poster from 1901) This is an example of a [[false Dilemma]]: an informal fallacy using a disjunctive premise that excludes viable alternatives.")
ألاسم
مُتَمَنْطِق ; مَنْطِقِيّ ; مِنْطِيق
Definición
Wikipedia
In computer science, an instruction set architecture (ISA), also called computer architecture, is an abstract model of a computer. A device that executes instructions described by that ISA, such as a central processing unit (CPU), is called an implementation.
In general, an ISA defines the supported instructions, data types, registers, the hardware support for managing main memory, fundamental features (such as the memory consistency, addressing modes, virtual memory), and the input/output model of a family of implementations of the ISA.
An ISA specifies the behavior of machine code running on implementations of that ISA in a fashion that does not depend on the characteristics of that implementation, providing binary compatibility between implementations. This enables multiple implementations of an ISA that differ in characteristics such as performance, physical size, and monetary cost (among other things), but that are capable of running the same machine code, so that a lower-performance, lower-cost machine can be replaced with a higher-cost, higher-performance machine without having to replace software. It also enables the evolution of the microarchitectures of the implementations of that ISA, so that a newer, higher-performance implementation of an ISA can run software that runs on previous generations of implementations.
If an operating system maintains a standard and compatible application binary interface (ABI) for a particular ISA, machine code will run on future implementations of that ISA and operating system. However, if an ISA supports running multiple operating systems, it does not guarantee that machine code for one operating system will run on another operating system, unless the first operating system supports running machine code built for the other operating system.
An ISA can be extended by adding instructions or other capabilities, or adding support for larger addresses and data values; an implementation of the extended ISA will still be able to execute machine code for versions of the ISA without those extensions. Machine code using those extensions will only run on implementations that support those extensions.
The binary compatibility that they provide makes ISAs one of the most fundamental abstractions in computing.
